Quantum Equivalent Magnetic Fields that Are Not Classically Equivalent

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An example of $,-equivalent spaces which are not &-equivalent

We construct an example of two countable spaces X and Y such that the spaces C,‘(X) and CG (Y) are homeomorphic and the spaces C,(X) and C,(Y) are not homeomorphic. o 1998 Elsevier Science B.V.

متن کامل

An Example of Kakutani Equivalent and Strong Orbit Equivalent Substitution Systems That Are Not Conjugate

We present an example of Kakutani equivalent and strong orbit equivalent substitution systems that are not conjugate. Introduction. The motivation for this example came from [2], in which Dartnell, Durand, and Maass show that a minimal Cantor system and a Sturmian subshift are conjugate if and only if they are Kakutani equivalent and orbit equivalent (or equivalently strong orbit equivalent for...

متن کامل

All Quantum Adversary Methods Are Equivalent

The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spectral adversary (Barnum, Saks, and Szegedy, 2003), weighted adversary (Ambainis, 2003), strong weighted adversary (Zhang, 2005), and the Kolmogorov complexity adversary (Laplante and Magniez, 2004). We also present a few new equi...

متن کامل

Generalized Intersection Bodies Are Not Equivalent

In [Kol00], A. Koldobsky asked whether two types of generalizations of the notion of an intersection-body, are in fact equivalent. The structures of these two types of generalized intersection-bodies have been studied in [Mil06b], providing substantial evidence for a positive answer to this question. The purpose of this note is to construct a counter-example, which provides a surprising negativ...

متن کامل

Not All Fair Probabilistic Schedulers Are Equivalent

We propose a novel, generic definition of probabilistic schedulers for population protocols. We then identify the consistent probabilistic schedulers, and prove that any consistent scheduler that assigns a non-zero probability to any transition i → j, where i and j are configurations satisfying i = j, is fair with probability 1. This is a new theoretical framework that aims to simplify proving ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales de l’institut Fourier

سال: 2010

ISSN: 0373-0956,1777-5310

DOI: 10.5802/aif.2612